LingPars, a Linguistically Inspired, Language-Independent Machine Learner for Dependency Treebanks
نویسنده
چکیده
This paper presents a Constraint Grammarinspired machine learner and parser, Ling Pars, that assigns dependencies to morpho logically annotated treebanks in a functioncentred way. The system not only bases at tachment probabilities for PoS, case, mood, lemma on those features' function probabili ties, but also uses topological features like function/PoS n-grams, barrier tags and daughter-sequences. In the CoNLL shared task, performance was below average on at tachment scores, but a relatively higher score for function tags/deprels in isolation suggests that the system's strengths were not fully exploited in the current architecture.
منابع مشابه
Learning to Search in Prague Dependency Treebank
We present Netgraph – an easy to use tool for searching in linguistically annotated treebanks. On several examples from the Prague Dependency Treebank we introduce the features of the searching language and show how to search for some frequent linguistic phenomena.
متن کاملCost Effective Dependency Parsing for Indian Languages
Indian languages are MoR-FWO1 and hence differ from English in structure and morphology. There are many distinguished characteristics possessed by Indian languages. While working with these languages we have to keep in mind, these characteristics and plan strategies accordingly. We worked on improving Dependency Parsing for Indian Languages, more specifically for Hindi, an Indo-Aryan Language. ...
متن کاملNetgraph - Making Searching in Treebanks Easy
Searching in a linguistically annotated treebank is a principal task that requires a sophisticated tool. Netgraph has been designed to perform the searching with maximum comfort and minimum requirements on its users. Although it has been developed primarily for the Prague Dependency Treebank 2.0 (Hajič et al. 2006), it can be used with other treebanks too, both dependency and constituent-struct...
متن کاملPDT 2.0 Requirements on a Query Language
Linguistically annotated treebanks play an essential part in the modern computational linguistics. The more complex the treebanks become, the more sophisticated tools are required for using them, namely for searching in the data. We study linguistic phenomena annotated in the Prague Dependency Treebank 2.0 and create a list of requirements these phenomena set on a search tool, especially on its...
متن کاملQuerying Diverse Treebanks in a Uniform Way
This paper presents a system for querying treebanks in a uniform way. The system is able to work with both dependency and constituency based treebanks in any language. We demonstrate its abilities on 11 different treebanks. The query language used by the system provides many features not available in other existing systems while still keeping the performance efficient. The paper also describes ...
متن کامل